A Matter of Trust: Skeptical Communication Between Coq and External Provers. (Question de confiance : communication sceptique entre Coq et des prouveurs externes)
نویسنده
چکیده
This thesis studies the cooperation between the Coq proof assistant and external provers through proof witnesses. We concentrate on two di erent kinds of provers that can return certi cates: rst, answers coming from SAT and SMT solvers can be checked in Coq to increase both the con dence in these solvers and Coq's automation; second, theorems established in interactive provers based on Higher-Order Logic can be exported to Coq and checked again, in order to o er the possibility to produce formal developments which mix these two di erent logical paradigms. It ended up in two software: SMTCoq, a bi-directional cooperation between Coq and SAT/SMT solvers, and HOLLIGHTCOQ, a tool importing HOL Light theorems into Coq. For both tools, we took great care to de ne amodular and e cient architecture, based on three clearly separated ingredients: an embedding of the formalism of the external tool inside Coq which is carefully translated into Coq terms, a certi ed checker to establish the proofs using the certi cates and a Ocaml preprocessor to transform proof witnesses coming from di erent provers into a generic certi cate. This division allows that a change in the format of proof witnesses only a ects the preprocessor, but no proved Coq code. Another fundamental component for e ciency and modularity is computational re ection, which exploits the computational power of Coq to establish generic and small proofs based on the certi cates.
منابع مشابه
A Matter of Trust: Skeptical Communication Between Coq and External Provers (Detailed Description)
Most theorem provers are either hard to trust because they are large programs or hard to use due to a lack of automation. They are thus used by two di erent communities depending on the property one needs most: the ability to prove quickly a large amount of theorems or a high level of safety. My thesis studies a communication between these di erent kinds of tools, by asking for proof witnesses ...
متن کاملA Certified Multi-prover Verification Condition Generator
Deduction-based software verification tools have reached a maturity allowing them to be used in industrial context where a very high level of assurance is required. This raises the question of the level of confidence we can grant to the tools themselves. We present a certified implementation of a verification condition generator. An originality is its genericity with respect to the logical cont...
متن کاملImplementing Secure Distributed Computing with Mobile Agents
Secure distributed computing addresses the problem of performing a computation with a number of mutually distrustful participants, in such a way that each of the participants has only limited access to the information needed for doing the computation. Over the past two decades, a number of solutions requiring no trusted third party have been developed using cryptographic techniques. The disadva...
متن کاملTowards the Integration of an Intuitionistic First-Order Prover into Coq
Sledgehammer [11] and HOLyHammer [5] drastically improved the productivity for users of proof assistants. They make the capabilities of automated theorem provers (ATPs) available from within interactive proof assistants. The large, monolithic design of state-of-the-art theorem provers can not be easily trusted to be free of bugs. Thus invoking theorem provers as an oracle is unacceptable for mo...
متن کاملPalaiseau Weakest Precondition Calculus , Revisited using Why 3
This report has two objectives. First, we present an original method of proof of soundness of a weakest precondition calculus, based on the notion of blocking semantics. The method mimics, at the level of logic specifications, the classical proof of type soundness. Moreover, the proof is performed formally using the Why3 environment for deductive verification, and we illustrate, along the devel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013